Ray Tracing using Hierarchies of Slab Cut Balls
نویسندگان
چکیده
In this paper, bounding volume trees of slab cut balls are evaluated and compared with other types of trees for ray tracing. A novel tree construction algorithm is proposed, which utilizes a relative orientation heuristic between parent and child nodes. Also, a fast intersection test between a ray and a slab cut ball is presented. Experimental comparisons to other commonly used enclosing shapes reveal that the slab cut ball is attractive. In particular, the slab cut ball outperforms the sphere in all tested scenes with speed-up factors between 1 and 4.
منابع مشابه
Ray Tracing with the Single Slab Hierarchy
Bounding volume hierarchies have become a very popular way to speed up ray tracing. In this paper we present a novel traversal and approximation scheme for bounding volume hierarchies, which is comparable in speed, has a very compact traversal algorithm and uses only 25% of the memory, compared to a standard bounding volume hierarchy.
متن کاملBounding Volume Hierarchies of Slab Cut Balls
We introduce a bounding volume hierarchy based on the Slab Cut Ball. This novel type of enclosing volume provides an attractive balance between tightness of fit, cost of overlap testing, and memory requirement. The hierarchy construction algorithm includes a new method for the construction of tight bounding volumes in worst case O(n) time, which means our tree data structure is constructed in O...
متن کاملUsing Projection to Accelerate Ray Tracing
Using Projection to accelerate Ray Tracing Anastasia Bezerianos M.Sc. Graduate Department of Computer Science University of Toronto 2001 The high cost of Ray Tracing image rendering has driven many researchers to devise acceleration techniques like bounding volume hierarchies. This thesis introduces new ways of building bounding volume hierarchies. We modify existing algorithms to use bounding ...
متن کاملParallel BVH Construction using Progressive Hierarchical Refinement
We propose a novel algorithm for construction of bounding volume hierarchies (BVHs) for multi-core CPU architectures. The algorithm constructs the BVH by a divisive top-down approach using a progressively refined cut of an existing auxiliary BVH. We propose a new strategy for refining the cut that significantly reduces the workload of individual steps of BVH construction. Additionally, we propo...
متن کاملAdaptive Bounding Volume Hierarchies for Efficient Collision Queries
The need for efficient interference detection frequently arises in computer graphics, robotics, virtual prototyping, surgery simulation, computer games, and visualization. To prevent bodies passing directly through each other, the simulation system must be able to track touching or intersecting geometric primitives. In interactive simulations, in which millions of geometric primitives may be in...
متن کامل